Some model theory for the modal $\mu$-calculus: syntactic characterisations of semantic properties
نویسندگان
چکیده
This paper contributes to the theory of the modal μ-calculus by proving some model-theoretic results. More in particular, we discuss a number of semantic properties pertaining to formulas of the modal μ-calculus. For each of these properties we provide a corresponding syntactic fragment, in the sense that a μ-formula ξ has the given property iff it is equivalent to a formula ξ′ in the corresponding fragment. Since this formula ξ′ will always be effectively obtainable from ξ, as a corollary, for each of the properties under discussion, we prove that it is decidable in elementary time whether a given μ-calculus formula has the property or not. The properties that we study all concern the way in which the meaning of a formula ξ in a model depends on the meaning of a single, fixed proposition letter p. For example, consider a formula ξ which is monotone in p; such a formula a formula ξ is called continuous (respectively, fully additive), if in addition it satisfies the property that, if ξ is true at a state s then there is a finite set (respectively, a singleton set) U such that ξ remains true at s if we restrict the interpretation of p to the set U . Each of the properties that we consider is, in a similar way, associated with one of the following special kinds of subset of a tree model: singletons, finite sets, finitely branching subtrees, noetherian subtrees (i.e., without infinite paths), and branches. Our proofs for these characterization results will be automata-theoretic in nature; we will see that the effectively defined maps on formulas are in fact induced by rather simple transformations on modal automata. Thus our results can also be seen as a contribution to the model theory of modal automata.
منابع مشابه
Some model theory for the modal μ-calculus: syntactic characterisations of semantic properties
This paper contributes to the theory of the modal μ-calculus by proving some model-theoretic results. More in particular, we discuss a number of semantic properties pertaining to formulas of the modal μ-calculus. For each of these properties we provide a corresponding syntactic fragment, in the sense that a μ-formula ξ has the given property iff it is equivalent to a formula ξ′ in the correspon...
متن کاملLORETO: A Tool for Reducing State Explosion in Verification of LOTOS Programs
LOTOS is a formal speciication language for concurrent and distributed systems. Basic LOTOS is the version of LOTOS without value-passing. A widely used approach to veriication of temporal properties is model checking. Often, in this approach the formal speciication is translated into a labeled transition systems on which formulae expressing properties are checked. A problem of this veriication...
متن کاملThe Descriptive Complexity of Modal $\mu$ Model-checking Games
This paper revisits the well-established relationship between the modal μ calculus Lμ and parity games to show that it is evenmore robust than previously known. It addresses the question of whether the descriptive complexity of Lμ model-checking games, previously known to depend on the syntactic complexity of a formula, depends in fact on its semantic complexity. It shows that up to formulas of...
متن کاملThe mu-calculus and model-checking
This chapter presents a part of the theory of the mu-calculus that is relevant to the, broadly understood, model-checking problem. The mu-calculus is one of the most important logics in model-checking. It is a logic with an exceptional balance between expressiveness and algorithmic properties. The chapter describes in length the game characterization of the semantics of the mu-calculus. It disc...
متن کاملGames for Verification: Algorithmic Issues
This dissertation deals with a number of algorithmic problems motivated by computer aided formal verification of finite state systems. The goal of formal verification is to enhance the design and development of complex systems by providing methods and tools for specifying and verifying correctness of designs. The success of formal methods in practice depends heavily on the degree of automation ...
متن کامل